Weakenings and Repairs in Supervisory Alliances
نویسندگان
چکیده
منابع مشابه
Separating the Fan Theorem and Its Weakenings
Varieties of the Fan Theorem have recently been developed in reverse constructive mathematics, corresponding to different continuity principles. They form a natural implicational hierarchy. Some of the implications have been shown to be strict, others strict in a weak context, and yet others not at all, using disparate techniques. Here we present a family of related Kripke models which suffices...
متن کاملStrong Alliances in Graphs
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
متن کاملSeparating the Fan Theorem and Its Weakenings II
Varieties of the Fan Theorem have recently been developed in reverse constructive mathematics, corresponding to different continuity principles. They form a natural implicational hierarchy. Earlier work showed all of these implications to be strict. Here we re-prove one of the strictness results, using very different arguments. The technique used is a mixture of realizability, forcing in the gu...
متن کاملOn defensive alliances and strong global offensive alliances
We consider complexity issues and upper bounds for defensive alliances and strong global offensive alliances in graphs. We prove that it is NP-complete to decide for a given 6-regular graph G and a given integer a, whether G contains a defensive alliance of order at most a. Furthermore, we prove that determining the strong global offensive alliance number γô(G) of a graph G is APX-hard for cubi...
متن کاملWeighted Alliances in Graphs
Let G = (V, E) be a graph and let W:V→N be a non-negative integer weighting of the vertices in V. A nonempty set of vertices S ⊆ V is called a weighted defensive alliance if ∀v ∈ S ,∑u∈N[v]∩S w(u) ≥ ∑x∈N(v)−S w(x). A non-empty set S ⊆ V is a weighted offensive alliance if ∀v ∈ δS ,∑u∈N(v)∩S w(u) ≥ ∑x∈N[v]−S w(x). A weighted alliance which is both defensive and offensive is called a weighted pow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Psychotherapy
سال: 1998
ISSN: 0002-9564,2575-6559
DOI: 10.1176/appi.psychotherapy.1998.52.4.450